Simple Square Smoothing Regularization Operators
نویسندگان
چکیده
Tikhonov regularization of linear discrete ill-posed problems often is applied with a finite difference regularization operator that approximates a low-order derivative. These operators generally are represented by banded rectangular matrices with fewer rows than columns. They therefore cannot be applied in iterative methods that are based on the Arnoldi process, which requires the regularization operator to be represented by a square matrix. This paper discusses two approaches to circumvent this difficulty: zero-padding of the rectangular matrices to make them square and extending the rectangular matrix to a square circulant. We also describe how to combine these operators by weighted averaging and with orthogonal projection. Applications to Arnoldi and Lanczos bidiagonalization-based Tikhonov regularization, as well as to truncated iteration with a range restricted minimal residual method, are presented.
منابع مشابه
Square smoothing regularization matrices with accurate boundary conditions
This paper is concerned with the solution of large-scale linear discrete ill-posed problems. The determination of a meaningful approximate solution of these problems requires regularization. We discuss regularization by the Tikhonov method and by truncated iteration. The choice of regularization matrix in Tikhonov regularization may significantly affect the quality of the computed approximate s...
متن کاملOn regularized Boltzmann operators
In this paper, we propose two regularization approaches for the Boltz-mann collision operator. The constructed operators preserve the mass, momentum and energy; their equilibrium states are Maxwellians and they satisfy the H theorem. In the rst approach, the regularization consists in allowing microscopic collisions which do not exactly preserve energy and momentum. However, the limit of the mo...
متن کاملEstimation of linear operators from scattered impulse responses
We provide a new estimator of integral operators with smooth kernels, obtained from a set of scattered and noisy impulse responses. The proposed approach relies on the formalism of smoothing in reproducing kernel Hilbert spaces and on the choice of an appropriate regularization term that takes the smoothness of the operator into account. It is numerically tractable in very large dimensions. We ...
متن کاملMorozov's Discrepancy Principle for Tikhonov Regularization of Severely Ill-posed Problems in Nite-dimensional Subspaces
In this paper severely ill-posed problems are studied which are represented in the form of linear operator equations with innnitely smoothing operators but with solutions having only a nite smoothness. It is well known, that the combination of Morozov's discrepancy principle and a nite dimensional version of the ordinary Tikhonov regularization is not always optimal because of its saturation pr...
متن کاملThe "weight smoothing" regularization of MLP for Jacobian stabilization
In an approximation problem with a neural network, a low-output root mean square (rms) error is not always a universal criterion. In this paper, we investigate problems where the Jacobians--first derivative of an output value with respect to an input value--of the approximation model are needed and propose to add a quality criterion on these Jacobians during the learning step. More specifically...
متن کامل